A Routing Mechanism by Distance - weighted Bloom Filter *
نویسندگان
چکیده
Bloom filters are used for resource routing and distance-weighted Bloom filters (dwBFs) are used as a concise representation of routing information for scattered resources in overlay networks. Today's DHT-based P2P lookups are always influenced by unnecessarily long routers in the underlay network. The reason is that the false positives appearing in DHT lookup can lead to incorrect direction. To apply dwBFs to scattered resources in overlay network can form a routing correcting mechanism. It can reduce the possibilities of incorrect direction under cases of false positives. To use dwBFs also can resolve another problem with DHT, its ineffectiveness in replica-handle. This paper describes a routing algorithm based on dwBFs and shows the results of simulation experiment.
منابع مشابه
Routing on large scale mobile ad hoc networks using bloom filters
A bloom filter is a probabilistic data structure used to test whether an element is a member of a set. The bloom filter shares some similarities to a standard hash table but has a higher storage efficiency. As a drawback, bloom filters allow the existence of false positives. These properties make bloom filters a suitable candidate for storing topological information in large-scale mobile ad hoc...
متن کاملOn the Feasibility of Gradient-based Routing Mechanisms Using Bloom Filters
Gradient-based routing using Bloom filters is an effective mechanism to enable data-driven queries in multi-hop networks. A node compressively describes its data items as a Bloom filter, which is then diffused away to the other nodes with information decay. The Bloom filters form an information potential that eventually navigates queries to the source node by ascending the potential field. The ...
متن کاملHR-SDBF: an approach to data-centric routing in WSNs
In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events, such as in query flooding. In this paper, we propose a routing protocol, called hint-based routing by scope decay bloom filter (HR-SDBF), that employs probabilistic hints. In the HR...
متن کاملFRTR: A Scalable Mechanism to Restore Routing Table Consistency
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. A periodic update approach, used by most routing protocols, is considered infeasible due to the large size of today’s global routing table. In FRTR neighboring routers periodically exchange Bloom filter digests of the routing state to ...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کامل